Addendum. Some Imperfect Paving Bricks

Some New Equivalences of Anderson’s Paving Conjectures

We prove some new equivalences of Anderson’s paving conjectures. Among these are a paving conjecture for positive matrices and for strictly upper triangular matrices.

Building Bricks with Bricks, with Mathematica

In this work we solve a special case of the problem of building an n-dimensional parallelepiped using a given set of n-dimensional parallelepipeds. Consider the identity x = xHx 1L Hx 2L + 3 xHx 1L + x. For sufficiently large x, we associate with x3 a cube with edges of size x, with x Hx 1L Hx 2L a parallelepiped with edges x, x 1, x 2, with 3 x Hx 1L three parallelepipeds of edges x, x 1, 1, a...

Some Properties of Automorphism Groups of Paving Matroids

This paper deals with the relation between the automorphism groups of some paving matroids and Z3, where Z3 is the additive group of modulo 3 over Z. It concludes that for paving matroids under most cases, Z3 is not isomorphic to the automorphism groups of these paving matroids. Even in the exceptional cases, we reasonably conjecture that Z3 is not isomorphic to the automorphism groups of the c...

Imperfect vaccination: some epidemiological and evolutionary consequences.

An aim of some vaccination programmes is to reduce the prevalence of an infectious disease and ultimately to eradicate it. We show that eradication success depends on the type of vaccine as well as on the vaccination coverage. Vaccines that reduce the parasite within-host growth rate select for higher parasite virulence and this evolution may both increase the prevalence of the disease and prev...

Addendum to "Current Approaches to Handling Imperfect Information in Data and Knowledge Bases"